public class code2 {
    public int uniquePathsWithObstacles(int[][] ob) {
        int m = ob.length;
        int n = ob[0].length;

        int[][] dp = new int[m+1][n+1];

        dp[0][1] = 1;

        for (int i = 1; i <=m ; i++) {
            for (int j = 1; j <=n ; j++) {
                if (ob[i-1][j-1]==0) {//没有障碍物就正常相加，有障碍物那么dp[i][j]就为0不用管
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }
            }
        }

        return dp[m][n];
    }
}
